Probabilistic Programming, Estimation, and Euclidean Model Checking for Aggregate Behavior of Concurrent Systems
نویسندگان
چکیده
منابع مشابه
channel estimation for mimo-ofdm systems
تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...
Model Checking and Testing of Concurrent Systems
This thesis is devoted to the formal analysis, verification and testing of concurrent systems based on symbolic transition graphs. The main contributions are: 1. A compositional framework is proposed for modeling network protocols using symbolic transition graphs. In this framework, a protocol entity is decomposed into a set of communicating sequential sub-tasks sharing a set of state variables...
متن کاملModel checking with probabilistic tabled logic programming
We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for qu...
متن کاملEuclidean Model Checking: A Scalable Method for Verifying Quantitative Properties in Probabilistic Systems
We typically represent the global state of a concurrent system as the crossproduct of individual states of its components. This leads to an explosion of potential global states: consider a concurrent system with a thousand actors, each of which may be in one of 5 states. This leads to a possible 5000 global states. Obviously, it is not feasible to exhaustively search the state space in such sys...
متن کاملModel Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilistic product automata (PPA) as a natural model for this kind of systems. To reason about these systems, we propose to use a product version of linear temporal logic (LTL). The main result of the paper is a model-checki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.217.2